General Algorithms for Computing Derivatives of Repeated Eigenvalues and Eigenvectors of Symmetric Quadratic Eigenvalue Problems
نویسندگان
چکیده
The numerical computation of derivatives of eigenvalues and eigenvectors has been an active research topic due to its wide applications in engineering and the physical sciences. There are many numerical methods available in the literatures for computing derivatives of eigenvalues and eigenvectors for standard eigenvalue problems and quadratic eigenvalue problems. However, almost all existing methods for quadratic eigenvalue problems have a common limitation, that is, they are based on the assumption that repeated eigenvalues have distinct first order derivatives. In this paper, we lift this assumption and develop general algorithms for computing derivatives, of any arbitrary order, of repeated eigenvalues and corresponding eigenvectors of quadratic eigenvalue problems, under much more general conditions than existing methods. The effectiveness of our algorithms are illustrated by some numerical examples.
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملFast Verification for All Eigenpairs in Symmetric Positive Definite Generalized Eigenvalue Problems
A fast method for enclosing all eigenpairs in symmetric positive definite generalized eigenvalue problems is proposed. Firstly theorems on verifying all eigenvalues are presented. Next a theorem on verifying all eigenvectors is presented. The proposed method is developed based on these theorems. Numerical results are presented showing the efficiency of the proposed method. As an application of ...
متن کاملTrading off Parallelism and Numerical Stability
[80] K. Veseli c. A quadratically convergent Jacobi-like method for real matrices with complex conjugate eigenvalues. [82] D. Watkins and L. Elsner. Convergence of algorithms of decomposition type for the eigenvalue problem. [83] Zhonggang Zeng. Homotopy-determinant algorithm for solving matrix eigenvalue problems and its parallelizations. [69] G. Shro. A parallel algorithm for the eigenvalues ...
متن کاملThe partial eigenvalue assignment for non-symmetric quadratic pencil in multi-input case
In this paper, we propose a parametric solution to the partial eigenvalue assignment problem by state feedback control for non-symmetric quadratic pencil in multi-input case using orthogonality relations between eigenvectors. Our solution can be implemented with only a partial knowledge of the spectrum and the corresponding eigenvectors of non-symmetric quadratic pencil. We show that the number...
متن کاملOn Inverse Quadratic Eigenvalue Problems with Partially Prescribed Eigenstructure
The inverse eigenvalue problem of constructing real and symmetric square matrices M , C, and K of size n × n for the quadratic pencil Q(λ) = λ2M + λC + K so that Q(λ) has a prescribed subset of eigenvalues and eigenvectors is considered. This paper consists of two parts addressing two related but different problems. The first part deals with the inverse problem where M and K are required to be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012